import java.util.Stack;
public class Solution{
public boolean isPopOrder(int[] pushA,int[] popA){
	if(pushA.length==0||popB.length==0){
		return false;
		}
	Stack<Integer> stack=new Stack<>();
	int j=0;
	for(int i=0;i<pushA.length;i++){
		stack.push(pushA[i]);
		if(!stack.isEmpty()&&stack.peek()==popA[j]){
			stack.pop();
			j++;
			}
		}
	return stack.isEmpty();
	}
}